Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis
نویسندگان
چکیده
We present an efficient phylogenetic reconstruction algorithm allowing insertions and deletions which provably achieves a sequencelength requirement (or sample complexity) growing polynomially in the number of taxa. Our algorithm is distance-based, that is, it relies on pairwise sequence comparisons. More importantly, our approach largely bypasses the difficult problem of multiple sequence alignment.
منابع مشابه
Alignment-Free Phylogenetic Reconstruction
We introduce the first polynomial-time phylogenetic reconstruction algorithm under a model of sequence evolution allowing insertions and deletions—or indels. Given appropriate assumptions, our algorithm requires sequence lengths growing polynomially in the number of leaf taxa. Our techniques are distance-based and largely bypass the problem of multiple alignment. ∗CSAIL, MIT. †Department of Mat...
متن کاملPath integral formulation and Feynman rules for phylogenetic branching models
A dynamical picture of phylogenetic evolution is given in terms of Markov models on a state space, comprising joint probability distributions for character types of taxonomic classes. Phylogenetic branching is a process which augments the number of taxa under consideration, and hence the rank of the underlying joint probability state tensor. We point out the combinatorial necessity for a second...
متن کاملMultiple sequence alignment in phylogenetic analysis.
Multiple sequence alignment is discussed in light of homology assessments in phylogenetic research. Pairwise and multiple alignment methods are reviewed as exact and heuristic procedures. Since the object of alignment is to create the most efficient statement of initial homology, methods that minimize nonhomology are to be favored. Therefore, among all possible alignments, the one that satisfie...
متن کاملAn Alignment-Free Distance Measure for Closely Related Genomes
Phylogeny reconstruction on a genome scale remains computationally challenging even for closely related organisms. Here we propose an alignmentfree pairwise distance measure, Kr, for genomes separated by less than approximately 0.5 mismatches/nucleotide. We have implemented the computation of Kr based on enhanced suffix arrays in the program kr, which is freely available from guanine.evolbio.mp...
متن کاملHandAlign: Bayesian multiple sequence alignment, phylogeny and ancestral reconstruction
UNLABELLED We describe handalign, a software package for Bayesian reconstruction of phylogenetic history. The underlying model of sequence evolution describes indels and substitutions. Alignments, trees and model parameters are all treated as jointly dependent random variables and sampled via Metropolis-Hastings Markov chain Monte Carlo (MCMC), enabling systematic statistical parameter inferenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1109.5002 شماره
صفحات -
تاریخ انتشار 2011